Path graph

Results: 1083



#Item
791Graph / Path / Discrete mathematics / Shortest path problem / Hamiltonian path / Matching / Signed graph / Path graph / Graph theory / Mathematics / Graph connectivity

Arizona’s College and Career Ready Standards – Mathematics – HS Contemporary Mathematics Placemat HS Conceptual Category: Contemporary Mathematics Domains Discrete Mathematics

Add to Reading List

Source URL: www.azed.gov

Language: English - Date: 2013-11-14 15:27:03
792Graph / Path / Shortest path problem / Hamiltonian path / Discrete mathematics / Matroid theory / Signed graph / Edge coloring / Graph theory / Mathematics / Graph connectivity

HS Conceptual Category: Contemporary Mathematics Domains

Add to Reading List

Source URL: www.azed.gov

Language: English - Date: 2013-11-14 15:27:03
793Operations research / NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Shortest path problem / Combinatorial optimization / Dynamic programming / Travelling salesman problem / Graph theory / Theoretical computer science / Mathematics

The Steiner Multigraph Problem: Wildlife corridor design for multiple species

Add to Reading List

Source URL: www.fs.fed.us

Language: English - Date: 2011-07-25 16:42:26
794Complexity classes / Matroid theory / NP-complete problems / Dimension / Matroid / Cubic graph / Induced path / NP-hard / Time complexity / Theoretical computer science / Graph theory / Mathematics

Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30

Add to Reading List

Source URL: www3.math.tu-berlin.de

Language: English
795Semantic Web / Information science / Knowledge engineering / Knowledge representation / RDF / Shortest path problem / Ontology / Graph / SPARQL / Graph theory / Mathematics / Theoretical computer science

QODI: Query as Context in Automatic Data Integration Aibo Tian, Juan F. Sequeda, Daniel P. Miranker Department of Computer Science, The University of Texas at Austin Austin, Texas, USA {atian, jsequeda, miranker}@cs.utex

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2013-08-06 12:59:57
796Centrality / Connectivity / Scale-free network / Vertex / Directed graph / Graph / Webgraph / Connected component / Eulerian path / Graph theory / Degree / Regular graph

Graph Structure in the Web — Revisited or A Trick of the Heavy Tail Robert Meusel Sebastiano Vigna

Add to Reading List

Source URL: www.wim.uni-mannheim.de

Language: English - Date: 2014-02-03 18:54:18
797Combinatorial optimization / NP-complete problems / Network theory / Dynamic programming / Equations / Systems engineering / Tree decomposition / Graph / Shortest path problem / Graph theory / Mathematics / Theoretical computer science

Optimal Cuts and Partitions in Tree Metrics in Polynomial Time Marek Karpinski∗ Andrzej Lingas†

Add to Reading List

Source URL: theory.cs.uni-bonn.de

Language: English - Date: 2012-12-14 09:54:30
798Routing algorithms / Combinatorial optimization / Network flow / Network theory / Shortest path problem / Distance / Graph / Matching / Floyd–Warshall algorithm / Mathematics / Graph theory / Theoretical computer science

2013 IEEE 54th Annual Symposium on Foundations of Computer Science A forward-backward single-source shortest paths algorithm Uri Zwick Tel Aviv University [removed]

Add to Reading List

Source URL: www.dbwilson.com

Language: English - Date: 2013-12-01 03:48:54
799Graph / Function / Connectivity / Algorithms for Recovery and Isolation Exploiting Semantics / Path decomposition / Median graph / Graph theory / Mathematics / Theoretical computer science

A Theory of Redo Recovery David Lomet Mark Tuttle Microsoft Research

Add to Reading List

Source URL: www.markrtuttle.com

Language: English - Date: 2007-04-26 00:00:00
800Graph / Neighbourhood / Signed graph / Matching / Degree / Minor / Covering graph / Path decomposition / Graph theory / Mathematics / Theoretical computer science

A Tight Lower Bound for k-Set Agreement Soma Chaudhuri Maurice Herlihyy Abstract: We prove tight bounds on the time needed

Add to Reading List

Source URL: www.markrtuttle.com

Language: English - Date: 2007-04-26 00:00:00
UPDATE